Coprime partitions and Jordan totient functions
نویسندگان
چکیده
We show that while the number of coprime compositions a positive integer n into k parts can be expressed as Q-linear combination Jordan totient functions, this is never possible for partitions parts. also pk′(n) C-linear sufficiently large, if and only k∈{2,3} in unique way. Finally we introduce some generalizations functions always them.
منابع مشابه
On Summatory Totient Functions
The function F [kuφv, N ] has been the subject of intensive study for the last century and is classically known [2] for u ≤ 0, v = 1. The other results include u = 0, v = −1 [8], v = −u > 0 [4], [3] and references therein, v ≥ 0, u < −v − 1 [6], u = 1, v = −1 [10], [15], u = v = −1 [9], [17]. The leading and error terms for u = 0, v ∈ Z+, were calculated in [4] and [3], respectively. An extensi...
متن کاملOn Four Pr.im:e and Coprime Functions
for his 70-th birthday In [1] F. Smarandache discussed the following particular cases of the well-know characteristic functions (see, e.g., [2] or [3]). Here we shall formulate and prove four assertions related to these functions.
متن کاملSome Partitions Consisting of Jordan Curves
Some decompositions of the three-dimensional sphere and three-dimensional ball into Jordan curves are considered. In particular, it is proved that for every strictly positive real number p ≤ 1 there exists a partition of the unit three-dimensional Euclidean sphere into circles whose radii are equal to p. Let S2 be the unit two-dimensional sphere in the Euclidean space R3 and let S3 be the unit ...
متن کاملSets, Partitions and Functions Interpolations
This paper presents the use of the SKIZ transformation to interpolate sets, partitions and functions. This transformation generates a sequence of intermediary sets which can be used to de ne a distance between the interpolated sets. Other distances are also introduced. These distances could be useful to generalise the interpolation algorithm. Some examples of use are given.
متن کاملParking functions and noncrossing partitions
A parking function is a sequence (a 1 ; : : : ; a n ) of positive integers such that if b 1 b 2 b n is the increasing rearrangement of a 1 ; : : : ; a n , then b i i. A noncrossing partition of the set [n] = f1; 2; : : : ; ng is a partition of the set [n] with the property that if a < b < c < d and some block B of contains both a and c, while some block B 0 of contains both b and d, then B = B ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2022
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2021.05.017